Rendezvous on a Planar Lattice
نویسندگان
چکیده
منابع مشابه
Rendezvous on a Planar Lattice
We analyze the optimal behavior of two players who are lost on a planar surface and who want to meet each other in least expected time. They each know the initial distribution of the others location, but have no common labeling of points, and so cannot simply go to a location agreed to in advance. They have no compasses, so do not even have a common notion of North. For simplicity, we restrict...
متن کاملBilateral Street Searching in Manhattan (Line-Of-Sight Rendezvous on a Planar Lattice)
We consider the rendezvous problem faced by two mobile agents, initially placed according to a known distribution on intersections in Manhatten (nodes of the integer lattice Z): We assume they can distinguish streets from avenues (the two axes) but have no common notion of North or East (positive directions along axes). How should they move, from node to adjacent node, so as to minimize the exp...
متن کاملA common notion of clockwise can help in planar rendezvous
Two players are lost in a grid of city streets and wish to meet as soon as possible. Knowing only the distribution of the other’s initial location (two nodes away in one of the four compass directions), how do they move from intersection to intersection (between nodes of the lattice Z) to achieve this? We assume that they do not have common compass directions to coordinate on, but that they can...
متن کاملAbout Orientifold Planar Equivalence on the Lattice
The orientifold planar equivalence is the equivalence in the large-N limit of the bosonic sectors of the super Yang-Mills and the QCD with a quark in the antisymmetric representation. I give a sketch of the proof of the orientifold planar equivalence in the strong-coupling and large-mass phase on the lattice. It is still matter of discussion, if its validity extends also in the continuum limit.
متن کاملPLANAR LATTICE GRAPHS WITH.dvi
Introduction. The property of the Petersen graph of being hypohamiltonian is notorious, and known for a long time. The existence of hypotraceable graphs, on the contrary, was discovered much later. Before that, in 1966, Gallai [1] had asked the easier question whether (connected) graphs do exist such that each vertex is missed by some longest path. Such graphs have been discovered by Walther in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2005
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.1050.0217